|
|
Web-Based Demo of Fourier Transform for Signal Processing Courses
Hyrš, Martin ; Plchot, Oldřich (referee) ; Černocký, Jan (advisor)
The aim of this work is to create a program demonstrating the Fourier transform. The introductory section summarizes the theory of Fourier transform and shows the procedure for its numerical approximation. The following chapter describes the existing applets. Subsequently, the concept of the demonstration and its implementation are described. The final part contains tutorial examples of using the application and summary of users' reactions.
|
|
|
Web-Based Demonstration of Linear Filtering
Novotný, Ondřej ; Bařina, David (referee) ; Černocký, Jan (advisor)
The aim of this work is to create a demonstration application of discrete linear filtering. The introductory section summarizes the theory of digital filtering and filter design. The following chapter describes the existing applets. Subsequently, the concept of the demonstration and its implementation are described. The final part contains tutorial examples of using the demonstration and summary of users' reactions.
|
|
|
User Interface Demo Program
Adámek, Michal ; Mlích, Jozef (referee) ; Zemčík, Pavel (advisor)
This bachelor's thesis describes analysis, design and implementation of an application for demonstrational program of various user interfaces on PC. The application allows creation of tasks and tests of these tasks. During the performance of the task are recorded all the actions that the user has made.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Demonstration Program of Sorting Methods in C Language
Pernica, Lukáš ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
The one of the basic skill of every computer programer in the subject of Information technology is to manage the problems of the sorting algorithm. Sorting algorithms are used in the very wide range and though they are writed differently in a different programming language, their principal remains same. At this work I'm going to deal with the problems of sorting algorithm and description of the program, which is part of this bachelor's thesis. The program have to demonstrate by the simple way the principles of the most used sorting algorithms and give us the clue to easier understanding of the sorting methods.
|
|
|
User Interface Demo Program
Adámek, Michal ; Mlích, Jozef (referee) ; Zemčík, Pavel (advisor)
This bachelor's thesis describes analysis, design and implementation of an application for demonstrational program of various user interfaces on PC. The application allows creation of tasks and tests of these tasks. During the performance of the task are recorded all the actions that the user has made.
|
|
|
Web-Based Demo of Fourier Transform for Signal Processing Courses
Hyrš, Martin ; Plchot, Oldřich (referee) ; Černocký, Jan (advisor)
The aim of this work is to create a program demonstrating the Fourier transform. The introductory section summarizes the theory of Fourier transform and shows the procedure for its numerical approximation. The following chapter describes the existing applets. Subsequently, the concept of the demonstration and its implementation are described. The final part contains tutorial examples of using the application and summary of users' reactions.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Web-Based Demonstration of Linear Filtering
Novotný, Ondřej ; Bařina, David (referee) ; Černocký, Jan (advisor)
The aim of this work is to create a demonstration application of discrete linear filtering. The introductory section summarizes the theory of digital filtering and filter design. The following chapter describes the existing applets. Subsequently, the concept of the demonstration and its implementation are described. The final part contains tutorial examples of using the demonstration and summary of users' reactions.
|
guest ::
